Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
نویسندگان
چکیده
In this paper we present algorithms that compute large matchings in planar graphs with fixed minimum degree. The algorithms give a guarantee on the size of the computed matching and run in linear time. Thus they are faster than the best known algorithm for computing maximum matchings in general graphs and in planar graphs, which run in O( √ nm) and O(n) time, respectively. For the class of planar graphs with minimum degree 3 the bounds we achieve are known to be best possible. Further, we discuss how minimum degree 5 can be used to obtain stronger bounds on the matching size.
منابع مشابه
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
We consider the problem of finding a planar embedding of a graph at fixed vertex locations that minimizes the total edge length. The problem is known to be NP-hard. We give polynomial time algorithms achieving an O( √ n logn) approximation for paths and matchings, and an O(n) approximation for general graphs.
متن کاملControllability and matchings in random bipartite graphs with a fixed degree distribution
We consider maximum matchings in random bipartite graphs with a fixed degree distribution. This extends and simplifies work by Bohman and Frieze [1] and is motivated by a question of controllability of networks recently considered by Liu, Slotine, and Barabási [2]. This is joint work with Paul Balister. [1] T. Bohman, A. Frieze, Karp-Sipser on random graphs with a fixed degree sequence, Combina...
متن کاملRepetition Number of Graphs
Every n-vertex graph has two vertices with the same degree (if n ≥ 2). In general, let rep(G) be the maximum multiplicity of a vertex degree in G. An easy counting argument yields rep(G) ≥ n/(2d − 2s + 1), where d is the average degree and s is the minimum degree of G. Equality can hold when 2d is an integer, and the bound is approximately sharp in general, even when G is restricted to be a tre...
متن کاملNC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs
In 1988, Vazirani gave an NC algorithm for computing the number of perfect matchings in K3,3-minor-free graphs by building on Kasteleyn’s scheme for planar graphs, and stated that this “opens up the possibility of obtaining an NC algorithm for finding a perfect matching in K3,3-free graphs.” In this paper, we finally settle this 30-year-old open problem. Building on the recent breakthrough resu...
متن کاملRandomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
We derive new results for the performance of a simple greedy algorithm for finding large independent sets and matchings in constant degree regular graphs. We show that for r-regular graphs with n nodes and girth at least g, the algorithm finds an independent set of expected cardinality f(r)n−O ( (r−1) g2 g 2 ! n ) , where f(r) is a function which we explicitly compute. A similar result is estab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009